Reflexive Intermediate Propositional Logics
نویسندگان
چکیده
منابع مشابه
Combining intermediate propositional logics with classical logic
In [17], we introduced a modal logic, called L, which combines intuitionistic propositional logic IPC and classical propositional logic CPC and is complete w.r.t. an algebraic semantics. However, L seems to be too weak for Kripke-style semantics. In this paper, we add positive and negative introspection and show that the resulting logic L5 has a Kripke semantics. For intermediate logics I , we ...
متن کاملSpace-efficient Decision Procedures for Three Interpolable Propositional Intermediate Logics
In this paper we present duplication-free tableau calculi for three propositional intermediate interpolable logics, namely the logic characterized by rooted Kripke models with depth two at most, the logic characterized by rooted Kripke models with two final elements at most and depth two at most and the logic characterized by rooted Kripke models with a final element at most (also known as Jank...
متن کاملCompact Propositional Gödel Logics
Entailment in propositional Gödel logics can be defined in a natural way. While all infinite sets of truth values yield the same sets of tautologies, the entailment relations differ. It is shown that there is a rich structure of infinite-valued Gödel logics, only one of which is compact. It is also shown that the compact infinite-valued Gödel logic is the only one which interpolates, and the on...
متن کاملSuper - Lukasiewicz Propositional Logics
In [8] (1920), Lukasiewicz introduced a 3-valued propositional calculus with one designated truth-value and later in [9], Lukasiewicz and Tarski generalized it to an m-valued propositional calculus (where m is a natural number or ^ 0 ) with one designated truth-value. For the original 3-valued propositional calculus, an axiomatization was given by Wajsberg [16] (1931). In a case of m Φ ^0> Ross...
متن کاملAxiomatizing Propositional Dependence Logics
We give sound and complete Hilbert-style axiomatizations for propositional dependence logic (PD), modal dependence logic (MDL), and extended modal dependence logic (EMDL) by extending existing axiomatizations for propositional logic and modal logic. In addition, we give novel labeled tableau calculi for PD, MDL, and EMDL. We prove soundness, completeness and termination for each of the labeled ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2006
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1143468310